some results on characterization of finite group by non commuting graph

نویسندگان

mohammad reza darafsheh

pedram yousefzadeh

چکیده

the non commuting graph of a non-abelian finite group $g$ is defined as follows: its vertex set is $g-z(g)$ and two distinct vertices $x$ and $y$ are joined by an edge if and only if the commutator of $x$ and $y$ is not the identity. in this paper we prove some new results about this graph. in particular we will give a new proof of theorem 3.24 of [2]. we also prove that if $g_1$, $g_2$, ..., $g_n$ are finite groups such that $z(g_i)=1$ for $i=1,2,...,n$ and they are characterizable by non commuting graph, then $g_1times ...times g_n$ is characterizable by non commuting graph.

Sign up for free to access the full text

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

characterization of the symmetric group by its non-commuting graph

the non-commuting graph $nabla(g)$ of a non-abelian group $g$ is defined as follows: its vertex set is $g-z(g)$ and two distinct vertices $x$ and $y$ are joined by an edge if and only if the commutator of $x$ and $y$ is not the identity. in this paper we 'll prove that if $g$ is a finite group with $nabla(g)congnabla(bs_{n})$, then $g cong bs_{n}$, where $bs_{n}$ is the symmetric group of degre...

متن کامل

SOME RESULTS ON THE COMPLEMENT OF THE INTERSECTION GRAPH OF SUBGROUPS OF A FINITE GROUP

Let G be a group. Recall that the intersection graph of subgroups of G is an undirected graph whose vertex set is the set of all nontrivial subgroups of G and distinct vertices H,K are joined by an edge in this graph if and only if the intersection of H and K is nontrivial. The aim of this article is to investigate the interplay between the group-theoretic properties of a finite group G and the...

متن کامل

A Kind of Non-commuting Graph of Finite Groups

Let g be a fixed element of a finite group G. We introduce the g-noncommuting graph of G whose vertex set is whole elements of the group G and two vertices x,y are adjacent whenever [x,y] g  and  [y,x] g. We denote this graph by . In this paper, we present some graph theoretical properties of g-noncommuting graph. Specially, we investigate about its planarity and regularity, its clique number a...

متن کامل

The Automorphism Group of Commuting Graph of a Finite Group

Let G be a finite group and X be a union of conjugacy classes of G. Define C(G,X) to be the graph with vertex set X and x, y ∈ X (x 6= y) joined by an edge whenever they commute. In the case that X = G, this graph is named commuting graph of G, denoted by ∆(G). The aim of this paper is to study the automorphism group of the commuting graph. It is proved that Aut(∆(G)) is abelian if and only if ...

متن کامل

Remarks On Commuting Graph of a Finite Group

The commuting graph ∆(G) of a group G is the graph whose vertex set is the group and two distinct elements x and y being adjacent if and only if xy = yx. In this paper the automorphism group of this graph is investigated. We observe that Aut(∆(G)) is a non-abelian group such that its order is not prime power and square-free.

متن کامل

Characterization of Finite Groups by Their Commuting Graph

The commuting graph of a group G, denoted by Γ(G), is a simple graph whose vertices are all non-central elements of G and two distinct vertices x, y are adjacent if xy = yx. In [1] it is conjectured that if M is a simple group and G is a group satisfying Γ(G) ∼= Γ(M), then G ∼= M . In this paper we prove this conjecture for many simple groups.

متن کامل

منابع من

با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید


عنوان ژورنال:
transactions on combinatorics

ناشر: university of isfahan

ISSN 2251-8657

دوره 1

شماره 2 2012

میزبانی شده توسط پلتفرم ابری doprax.com

copyright © 2015-2023